Constructing Efficient Certificateless Public Key Encryption with Pairing

نویسندگان

  • Yijuan Shi
  • Jianhua Li
  • Jianjun Shi
چکیده

Certificateless public key cryptography was introduced to overcome the key escrow limitation of the identity-based cryptography. Recently, Yum1 and Lee have proposed a generic series construction model of certificateless public key encryption (CL-PKE). However, this model pays much attention on the generic construction and neglects the properties of the pairings. In this paper we propose a CL-PKE scheme which is based on the nice algebraic properties of the pairing. The scheme breaks through the old series model and works in an efficient parallel model. Our scheme is more efficient on computation and has more compact ciphertext than the existing schemes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Confidentiality Preserving Scheme Using Certificateless Encryption with High Trust Level

Certificateless public key cryptography with bilinear pairing needs costly operations, which is not appropriate for a practical application. In this paper, we present a certificateless public key encryption scheme without bilinear pairing. This encryption scheme achieves Girault’s trust Level 3 as in traditional public key infrastructure based cryptography, and which is proved to be secure in t...

متن کامل

Secure Certificateless Public Key Encryption without Redundancy

Certificateless public key cryptography was introduced to solve the key escrow problem in identity based cryptography while enjoying the most attractive certificateless property. In this paper, we present the first secure certificateless public key encryption (CLPKE) scheme without redundancy. Our construction provides optimal bandwidth and quite efficient decryption process compared with the e...

متن کامل

Certificateless Signcryption without Pairing

Certificateless public key cryptography is receiving significant attention because it is a new paradigm that simplifies the traditional PKC and solves the inherent key escrow problem suffered by ID-PKC. Certificateless signcryption is one of the most important security primitives in CL-PKC. However, to the best of our knowledge, all constructions of certificateless signcryption (CLSC) in the li...

متن کامل

Certificateless Key-Insulated Encryption: Cryptographic Primitive for Achieving Key-Escrow Free and Key-Exposure Resilience

Certificateless encryption (CLE) alleviates the heavy certificate management in traditional public key encryption and the key escrow problem in the ID-based encryption simultaneously. Current CLE schemes assumed that the user’s secret key is absolutely secure. Unfortunately, this assumption is too strong in case the CLE is deployed in the hostile setting and the leakage of secret key is inevita...

متن کامل

An Efficient Certificateless Proxy Re-Encryption Scheme Without Pairing

Proxy re-encryption (PRE) is a cryptographic primitive introduced by Blaze, Bleumer and Strauss [4] to provide delegation of decryption rights. PRE allows re-encryption of a ciphertext intended for Alice (delegator) to a ciphertext for Bob (delegatee) via a semi-honest proxy, who should not learn anything about the underlying message. In 2003, Al-Riyami and Patterson introduced the notion of ce...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Network Security

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2008